Merging percolation and classical random graphs : Phase transition in dimension 1
نویسندگان
چکیده
We study a random graph model which combines properties of the edge percolation model on Z d and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called " rank 1 case " of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe completely the phase diagram in the case d = 1. The phase transition is similar to the classical random graph, it is of the second order. We also find the scaled size of the largest connected component above the phase transition.
منابع مشابه
Merging percolation on Z and classical random graphs: Phase transition
We study a random graph model which is a superposition of the bond percolation model on Zd with probability p of an edge, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called ”rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describ...
متن کاملMerging percolation on Zd and classical random graphs: Phase transition
We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called “rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on ...
متن کاملClique percolation in random graphs
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k cliques means that they share at least l<k vertices. In this paper we develop a theoretical approach to study clique percolation in Erdős-Rényi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order para...
متن کاملRandom subgraphs of finite graphs: II. The lace expansion and the triangle condition
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper, we use a new and simplified approach to the l...
متن کاملRandom Subgraphs of Finite Graphs. Ii. the Lace Expansion and the Triangle Condition by Christian Borgs,
In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lac...
متن کامل